/*
Source : https://leetcode.com/problems/merge-k-sorted-lists/
Author : nflush@outlook.com
Date   : 2016-07-22
*/

/*
23. Merge k Sorted Lists
 ?  

Question Editorial Solution  
 My Submissions 




?Total Accepted: 94485
?Total Submissions: 390865
?Difficulty: Hard



Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 



Subscribe to see which companies asked this question
*/

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        
    }
};
